A particle swarm optimisation for the no-wait flow shop problem with due date constraints

Comparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints

The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...

On the exact solution of the no-wait flow shop problem with due date constraints

Solving Re-entrant No-wait Flow Shop Scheduling Problem

In this study, we consider the production environment of no-wait reentrant flow shop with the objective of minimizing makespan of the jobs. In a reentrant flow shop, at least one job should visit at least one of the machines more than once. In a no-wait flowshop scheduling problem, when the process of a specific job begins on the first machine, it should constantly be processed without waiting ...

Hybrid Particle Swarm Optimization for Stochastic Flow Shop Scheduling With No-wait Constraint

The flow shop scheduling with the no-wait constraint is a typical NP-hard combinatorial optimization problem and represents an important area in production scheduling. In this paper, a class of particle swarm optimization (PSO) approach with simulated annealing (SA) and hypothesis test (HT), namely PSOSAHT is proposed for the stochastic flow shop scheduling with no-wait constraint to minimize t...

Evolutionary Hybrid Particle Swarm Optimization Algorithm for Solving NP-Hard No-Wait Flow Shop Scheduling Problems

The no-wait flow shop is a flowshop in which the scheduling of jobs is continuous and simultaneous through all machines without waiting for any consecutive machines. The scheduling of a no-wait flow shop requires finding an appropriate sequence of jobs for scheduling, which in turn reduces total processing time. The classical brute force method for finding the probabilities of scheduling for im...